def binary_tree_equal(node1, node2):
    if node1 is None and node2 is None:
        return True
    elif node1 is not None and node2 is not None:
        if node1.val == node2.val:
            return binary_tree_equal(node1.left, node2.left) and binary_tree_equal(node1.right, node2.right)
        else:
            return False
    else:
        return False


def rough_equal(num1, num2, eps=1e-5):
    return (num1 - eps) < num2 < (num1 + eps)
